On the Correspondence Between Conformance Testing and Regular Inference
نویسندگان
چکیده
Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of techniques adopted from automata learning. In this paper we establish a common framework to investigate the similarities of these techniques by showing how results in one area can be transferred to results in the other and to explain the reasons for their differences.
منابع مشابه
DTD Inference for Views of XML
We study the inference of Data Type Deenitions (DTDs) for views of XML data, using an abstraction that focuses on document content structure. The views are deened by a query language that produces a list of documents selected from one or more input sources. The selection conditions involve vertical and horizontal navigation, thus querying explicitly the order present in input documents. We poin...
متن کاملDTD Inference for Views of XML Data (AMERICA251)
We study the inference of DTDs for views of XML data, using an abstraction that focuses on document content structure. The view de nition language produces a list of documents selected from one or more input sources. The selection conditions involve vertical and horizontal navigation, thus querying explicitly the order present in input documents. We point several strong limitations of DTDs and ...
متن کاملEfficient Inference of Mealy Machines
Automata learning is increasingly being applied to ease the testing and comparing of complex systems. We formally reconstruct an efficient algorithm for the inference of Mealy machines, prove its correctness, and show that equivalence queries are not required for nonminimal hypotheses. In fact, we are able to evade those by applying a minor optimization to the algorithm. As a corollary, standar...
متن کاملA Declarative Profile Model for QoS negotiation
In this report we define the semantics of a language for dynamic QoS expressions which can be evaluated at run-time for conformance. We define how expressions can be constructed from atomic expressions termed ’basic profiles’ using composition operators. Two such operators are defined: The sum ( ’+’ ) which corresponds to simple conjunction and component-sum (’⊕’) which assume that the operands...
متن کاملA Formal TLS Handshake Model in LNT
Testing of network services represents one of the biggest challenges in cyber security. Because new vulnerabilities are detected on a regular basis, more research is needed. These faults have their roots in the software development cycle or because of intrinsic leaks in the system specification. Conformance testing checks whether a system behaves according to its specification. Here model-based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005